0.07/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.13	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.12/0.34	% Computer   : n007.cluster.edu
0.12/0.34	% Model      : x86_64 x86_64
0.12/0.34	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.34	% Memory     : 8042.1875MB
0.12/0.34	% OS         : Linux 3.10.0-693.el7.x86_64
0.12/0.34	% CPULimit   : 1200
0.12/0.34	% WCLimit    : 120
0.12/0.34	% DateTime   : Tue Jul 13 16:01:34 EDT 2021
0.20/0.34	% CPUTime    : 
0.20/0.35	% Number of cores: 8
0.20/0.35	% Python version: Python 3.6.8
0.20/0.35	# Version: 2.6rc1-ho
0.20/0.35	# No SInE strategy applied
0.20/0.35	# Trying AutoSched0 for 59 seconds
0.20/0.38	# AutoSched0-Mode selected heuristic G_E___208_C18AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
0.20/0.38	# and selection function SelectComplexExceptUniqMaxHorn.
0.20/0.38	#
0.20/0.38	# Preprocessing time       : 0.031 s
0.20/0.38	# Presaturation interreduction done
0.20/0.38	
0.20/0.38	# Proof found!
0.20/0.38	# SZS status Theorem
0.20/0.38	# SZS output start CNFRefutation
0.20/0.38	thf(breln1, axiom, (breln1)=(^[X1:$i, X4:$i]:subset @ X4 @ (cartprod @ X1 @ X1)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', breln1)).
0.20/0.38	thf(breln, axiom, (breln)=(^[X1:$i, X2:$i, X3:$i]:subset @ X3 @ (cartprod @ X1 @ X2)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', breln)).
0.20/0.38	thf(setOfPairsIsBReln1, axiom, (setOfPairsIsBReln1<=>![X1:$i, X5:$i > $i > $o]:breln1 @ X1 @ (dpsetconstr @ X1 @ X1 @ (^[X6:$i, X7:$i]:X5 @ X6 @ X7))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', setOfPairsIsBReln1)).
0.20/0.38	thf(breln1compprop, conjecture, (setOfPairsIsBReln1=>![X1:$i, X4:$i]:(![X8:$i]:(breln1 @ X1 @ (breln1compset @ X1 @ X4 @ X8)<=breln1 @ X1 @ X8)<=breln1 @ X1 @ X4)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', breln1compprop)).
0.20/0.38	thf(breln1compset, axiom, (breln1compset)=(^[X1:$i, X4:$i, X8:$i]:dpsetconstr @ X1 @ X1 @ (^[X6:$i, X7:$i]:?[X9:$i]:((in @ X9 @ X1&in @ (kpair @ X6 @ X9) @ X4)&in @ (kpair @ X9 @ X7) @ X8))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', breln1compset)).
0.20/0.38	thf(c_0_5, axiom, (breln1)=(^[X1:$i, X4:$i]:subset @ X4 @ (cartprod @ X1 @ X1)), inference(apply_def,[status(thm)],[breln1, breln])).
0.20/0.38	thf(c_0_6, axiom, (setOfPairsIsBReln1)=(![X1:$i, X5:$i > $i > $o]:subset @ (dpsetconstr @ X1 @ X1 @ (^[X6:$i, X7:$i]:X5 @ X6 @ X7)) @ (cartprod @ X1 @ X1)), inference(apply_def,[status(thm)],[setOfPairsIsBReln1, c_0_5])).
0.20/0.38	thf(c_0_7, plain, ![X7:$i, X6:$i, X5:$i > $i > $o]:(epred2_3 @ X5 @ X6 @ X7<=>X5 @ X6 @ X7), introduced(definition)).
0.20/0.38	thf(c_0_8, plain, ![X16:$i, X15:$i, X1:$i, X4:$i, X8:$i]:(epred1_5 @ X8 @ X4 @ X1 @ X15 @ X16<=>?[X17:$i]:((in @ X17 @ X1&in @ (kpair @ X15 @ X17) @ X4)&in @ (kpair @ X17 @ X16) @ X8)), introduced(definition)).
0.20/0.38	thf(c_0_9, negated_conjecture, ~((![X1:$i, X5:$i > $i > $o]:subset @ (dpsetconstr @ X1 @ X1 @ (epred2_3 @ X5)) @ (cartprod @ X1 @ X1)=>![X1:$i, X4:$i]:(subset @ X4 @ (cartprod @ X1 @ X1)=>![X8:$i]:(subset @ X8 @ (cartprod @ X1 @ X1)=>subset @ (breln1compset @ X1 @ X4 @ X8) @ (cartprod @ X1 @ X1))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[breln1compprop]), c_0_5]), c_0_6]), c_0_7])])).
0.20/0.38	thf(c_0_10, plain, ![X1:$i, X4:$i, X8:$i]:(breln1compset @ X1 @ X4 @ X8)=(dpsetconstr @ X1 @ X1 @ (epred1_5 @ X8 @ X4 @ X1)), inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[breln1compset]), c_0_8])).
0.20/0.38	thf(c_0_11, negated_conjecture, ![X21:$i, X22:$i > $i > $o]:(subset @ (dpsetconstr @ X21 @ X21 @ (epred2_3 @ X22)) @ (cartprod @ X21 @ X21)&(subset @ esk2_0 @ (cartprod @ esk1_0 @ esk1_0)&(subset @ esk3_0 @ (cartprod @ esk1_0 @ esk1_0)&~subset @ (breln1compset @ esk1_0 @ esk2_0 @ esk3_0) @ (cartprod @ esk1_0 @ esk1_0)))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])])).
0.20/0.38	thf(c_0_12, plain, ![X18:$i, X19:$i, X20:$i]:(breln1compset @ X18 @ X19 @ X20)=(dpsetconstr @ X18 @ X18 @ (epred1_5 @ X20 @ X19 @ X18)), inference(variable_rename,[status(thm)],[c_0_10])).
0.20/0.38	thf(c_0_13, negated_conjecture, ![X5:$i > $i > $o, X1:$i]:subset @ (dpsetconstr @ X1 @ X1 @ (epred2_3 @ X5)) @ (cartprod @ X1 @ X1), inference(split_conjunct,[status(thm)],[c_0_11])).
0.20/0.38	thf(c_0_14, plain, ![X3:$i, X2:$i, X1:$i]:(breln1compset @ X1 @ X2 @ X3)=(dpsetconstr @ X1 @ X1 @ (epred1_5 @ X3 @ X2 @ X1)), inference(split_conjunct,[status(thm)],[c_0_12])).
0.20/0.38	thf(c_0_15, plain, ![X1:$i, X2:$i, X3:$i, X5:$i > $i > $o]:(subset @ (breln1compset @ X1 @ X2 @ X3) @ (cartprod @ X1 @ X1)|(epred1_5 @ X3 @ X2 @ X1)!=(epred2_3 @ X5)), inference(er,[status(thm)],[inference(ext_sup,[status(thm)],[c_0_13, c_0_14])])).
0.20/0.38	thf(c_0_16, plain, ![X5:$i > $i > $o, X3:$i, X2:$i, X1:$i]:(subset @ (breln1compset @ X1 @ X2 @ X3) @ (cartprod @ X1 @ X1)|(epred1_5 @ X3 @ X2 @ X1 @ (esk5_4 @ X5 @ X3 @ X2 @ X1) @ (esk6_4 @ X5 @ X3 @ X2 @ X1))!=(epred2_3 @ X5 @ (esk5_4 @ X5 @ X3 @ X2 @ X1) @ (esk6_4 @ X5 @ X3 @ X2 @ X1))), inference(neg_ext,[status(thm)],[c_0_15])).
0.20/0.38	thf(c_0_17, plain, ![X38:$i, X39:$i, X40:$i > $i > $o]:((~epred2_3 @ X40 @ X39 @ X38|X40 @ X39 @ X38)&(~X40 @ X39 @ X38|epred2_3 @ X40 @ X39 @ X38)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])).
0.20/0.38	thf(c_0_18, negated_conjecture, ~subset @ (breln1compset @ esk1_0 @ esk2_0 @ esk3_0) @ (cartprod @ esk1_0 @ esk1_0), inference(split_conjunct,[status(thm)],[c_0_11])).
0.20/0.38	thf(c_0_19, plain, ![X1:$i, X2:$i, X5:$i > $i > $o, X3:$i]:(epred1_5 @ X1 @ X2 @ X3 @ (esk5_4 @ X5 @ X1 @ X2 @ X3) @ (esk6_4 @ X5 @ X1 @ X2 @ X3)|epred2_3 @ X5 @ (esk5_4 @ X5 @ X1 @ X2 @ X3) @ (esk6_4 @ X5 @ X1 @ X2 @ X3)|subset @ (breln1compset @ X3 @ X2 @ X1) @ (cartprod @ X3 @ X3)), inference(dynamic cnf,[status(thm)],[c_0_16])).
0.20/0.38	thf(c_0_20, plain, ![X1:$i, X5:$i > $i > $o, X2:$i]:(X5 @ X1 @ X2|~epred2_3 @ X5 @ X1 @ X2), inference(split_conjunct,[status(thm)],[c_0_17])).
0.20/0.38	thf(c_0_21, negated_conjecture, ![X5:$i > $i > $o]:(epred1_5 @ esk3_0 @ esk2_0 @ esk1_0 @ (esk5_4 @ X5 @ esk3_0 @ esk2_0 @ esk1_0) @ (esk6_4 @ X5 @ esk3_0 @ esk2_0 @ esk1_0)|epred2_3 @ X5 @ (esk5_4 @ X5 @ esk3_0 @ esk2_0 @ esk1_0) @ (esk6_4 @ X5 @ esk3_0 @ esk2_0 @ esk1_0)), inference(spm,[status(thm)],[c_0_18, c_0_19])).
0.20/0.38	thf(c_0_22, plain, ![X5:$i > $i > $o]:(epred1_5 @ esk3_0 @ esk2_0 @ esk1_0 @ (esk5_4 @ X5 @ esk3_0 @ esk2_0 @ esk1_0) @ (esk6_4 @ X5 @ esk3_0 @ esk2_0 @ esk1_0)|X5 @ (esk5_4 @ X5 @ esk3_0 @ esk2_0 @ esk1_0) @ (esk6_4 @ X5 @ esk3_0 @ esk2_0 @ esk1_0)), inference(spm,[status(thm)],[c_0_20, c_0_21])).
0.20/0.38	thf(c_0_23, plain, ![X5:$i > $i > $o, X3:$i, X2:$i, X1:$i]:(subset @ (breln1compset @ X1 @ X2 @ X3) @ (cartprod @ X1 @ X1)|~epred1_5 @ X3 @ X2 @ X1 @ (esk5_4 @ X5 @ X3 @ X2 @ X1) @ (esk6_4 @ X5 @ X3 @ X2 @ X1)|~epred2_3 @ X5 @ (esk5_4 @ X5 @ X3 @ X2 @ X1) @ (esk6_4 @ X5 @ X3 @ X2 @ X1)), inference(dynamic cnf,[status(thm)],[c_0_16])).
0.20/0.38	thf(c_0_24, plain, epred1_5 @ esk3_0 @ esk2_0 @ esk1_0 @ (esk5_4 @ (epred1_5 @ esk3_0 @ esk2_0 @ esk1_0) @ esk3_0 @ esk2_0 @ esk1_0) @ (esk6_4 @ (epred1_5 @ esk3_0 @ esk2_0 @ esk1_0) @ esk3_0 @ esk2_0 @ esk1_0), inference(ef,[status(thm)],[c_0_22])).
0.20/0.38	thf(c_0_25, plain, ~epred2_3 @ (epred1_5 @ esk3_0 @ esk2_0 @ esk1_0) @ (esk5_4 @ (epred1_5 @ esk3_0 @ esk2_0 @ esk1_0) @ esk3_0 @ esk2_0 @ esk1_0) @ (esk6_4 @ (epred1_5 @ esk3_0 @ esk2_0 @ esk1_0) @ esk3_0 @ esk2_0 @ esk1_0), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23, c_0_24]), c_0_18])).
0.20/0.38	thf(c_0_26, plain, ![X1:$i, X5:$i > $i > $o, X2:$i]:(epred2_3 @ X5 @ X1 @ X2|~X5 @ X1 @ X2), inference(split_conjunct,[status(thm)],[c_0_17])).
0.20/0.38	thf(c_0_27, plain, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25, c_0_26]), c_0_24])]), ['proof']).
0.20/0.38	# SZS output end CNFRefutation
0.20/0.38	# Proof object total steps             : 28
0.20/0.38	# Proof object clause steps            : 14
0.20/0.38	# Proof object formula steps           : 14
0.20/0.38	# Proof object conjectures             : 6
0.20/0.38	# Proof object clause conjectures      : 3
0.20/0.38	# Proof object formula conjectures     : 3
0.20/0.38	# Proof object initial clauses used    : 5
0.20/0.38	# Proof object initial formulas used   : 5
0.20/0.38	# Proof object generating inferences   : 5
0.20/0.38	# Proof object simplifying inferences  : 4
0.20/0.38	# Training examples: 0 positive, 0 negative
0.20/0.38	# Parsed axioms                        : 14
0.20/0.38	# Removed by relevancy pruning/SinE    : 0
0.20/0.38	# Initial clauses                      : 20
0.20/0.38	# Removed in clause preprocessing      : 9
0.20/0.38	# Initial clauses in saturation        : 11
0.20/0.38	# Processed clauses                    : 37
0.20/0.38	# ...of these trivial                  : 0
0.20/0.38	# ...subsumed                          : 0
0.20/0.38	# ...remaining for further processing  : 37
0.20/0.38	# Other redundant clauses eliminated   : 1
0.20/0.38	# Clauses deleted for lack of memory   : 0
0.20/0.38	# Backward-subsumed                    : 0
0.20/0.38	# Backward-rewritten                   : 0
0.20/0.38	# Generated clauses                    : 30
0.20/0.38	# ...of the previous two non-trivial   : 20
0.20/0.38	# Contextual simplify-reflections      : 0
0.20/0.38	# Paramodulations                      : 17
0.20/0.38	# Factorizations                       : 2
0.20/0.38	# NegExts                              : 3
0.20/0.38	# Equation resolutions                 : 1
0.20/0.38	# Propositional unsat checks           : 0
0.20/0.38	#    Propositional check models        : 0
0.20/0.38	#    Propositional check unsatisfiable : 0
0.20/0.38	#    Propositional clauses             : 0
0.20/0.38	#    Propositional clauses after purity: 0
0.20/0.38	#    Propositional unsat core size     : 0
0.20/0.38	#    Propositional preprocessing time  : 0.000
0.20/0.38	#    Propositional encoding time       : 0.000
0.20/0.38	#    Propositional solver time         : 0.000
0.20/0.38	#    Success case prop preproc time    : 0.000
0.20/0.38	#    Success case prop encoding time   : 0.000
0.20/0.38	#    Success case prop solver time     : 0.000
0.20/0.38	# Current number of processed clauses  : 24
0.20/0.38	#    Positive orientable unit clauses  : 5
0.20/0.38	#    Positive unorientable unit clauses: 0
0.20/0.38	#    Negative unit clauses             : 2
0.20/0.38	#    Non-unit-clauses                  : 17
0.20/0.38	# Current number of unprocessed clauses: 5
0.20/0.38	# ...number of literals in the above   : 11
0.20/0.38	# Current number of archived formulas  : 0
0.20/0.38	# Current number of archived clauses   : 13
0.20/0.38	# Clause-clause subsumption calls (NU) : 93
0.20/0.38	# Rec. Clause-clause subsumption calls : 85
0.20/0.38	# Non-unit clause-clause subsumptions  : 0
0.20/0.38	# Unit Clause-clause subsumption calls : 0
0.20/0.38	# Rewrite failures with RHS unbound    : 0
0.20/0.38	# BW rewrite match attempts            : 1
0.20/0.38	# BW rewrite match successes           : 0
0.20/0.38	# Condensation attempts                : 0
0.20/0.38	# Condensation successes               : 0
0.20/0.38	# Termbank termtop insertions          : 1758
0.20/0.39	
0.20/0.39	# -------------------------------------------------
0.20/0.39	# User time                : 0.031 s
0.20/0.39	# System time              : 0.006 s
0.20/0.39	# Total time               : 0.037 s
0.20/0.39	# Maximum resident set size: 1652 pages
0.20/0.39	EOF